Tolerable Solution Set for Interval Linear Systems with Constraints on Coefficients
نویسندگان
چکیده
We develop a technique for computing tolerable solution set for interval linear systems with convex polyhedral ties upon its coefficients. The tolerable solution set in the above problem is proved to be the intersection of finite number of hyperstripes, i.e. a solution set to a finite system of two-sided nonstrict linear inequalities. For some specific ties on the coefficients, we propose simplified variants of the general method.
منابع مشابه
A New Method for Solving the Fully Interval Bilevel Linear Programming Problem with Equal Constraints
Most research on bilevel linear programming problem is focused on its deterministic form, in which the coefficients and decision variables in the objective functions and constraints are assumed to be crisp. In fact, due to inaccurate information, it is difficult to know exactly values of coefficients that used to construct a bilevel model. The interval set theory is suitable for describing and...
متن کاملA new method for solving fuzzy multi-objective linear programming problems
The purpose of this paper is to develop a new two-stage method for fuzzy multi-objective linear program and apply to engineering project portfolio selection. In the fuzzy multi-objective linear program, all the objective coefficients, technological coefficients and resources are trapezoidal fuzzy numbers (TrFNs). An order relationship for TrFNs is introduced by using the interval expectation of...
متن کاملComputing Best Possible Pseudo-Solutions to Interval Linear Systems of Equations
In the paper, we consider interval linear algebraic systems of equations Ax = b, with an interval matrix A and interval right-hand side vector b, as a model of imprecise systems of linear algebraic equations of the same form. We propose a new regularization procedure that reduces the solution of the imprecise linear system to computing a point from the tolerable solution set for the interval li...
متن کاملA Survey on Different Solution Concepts in Multiobjective Linear Programming Problems with Interval Coefficients
Optimization problems have dedicated a branch of research to themselves for a long time ago. In this field, multiobjective programming has special importance. Since in most real-world multiobjective programming problems the possibility of determining the coefficients certainly is not existed, multiobjective linear programming problems with interval coefficients are investigated in this paper. C...
متن کاملStability and numerical solution of time variant linear systems with delay in both the state and control
In this paper, stability for uncertain time variant linear systems with time delay is studied. A new sufficient condition for delay-dependent systems is given in matrix inequality form which depends on the range of delay. Then, we introduce a new direct computational method to solve delay systems. This method consists of reducing the delay problem to a set of algebraic equations by first expand...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Reliable Computing
دوره 15 شماره
صفحات -
تاریخ انتشار 2011